Herak Milošević: A cramer from Maleševac
نویسندگان
چکیده
منابع مشابه
Cramer-Rao Bounds for Nonparametric Surface Reconstruction from Range Data
The Cramer-Rao error bound provides a fundamental limit on the expected performance of a statistical estimator. The error bound depends on the general properties of the system, but not on the specific properties of the estimator or the solution. The Cramer-Rao error bound has been applied to scalarand vector-valued estimators and recently to parametric shape estimators. However, nonparametric, ...
متن کاملf/sla from learner perspectives: a social activity or a cognitive process
in the past couple of decades sociocultural theory of sla and its implications in efl contexts have attracted attentions of research circles worldwide and aroused some controversies. firth and wagner (1997) have questioned the principles of the cognitive view which gives importance to mental constructs in favor of sociocultural view which highlights social and contextual constructs. but if soci...
15 صفحه اولA Cramer-Shoup Encryption Scheme from the Linear Assumption and from Progressively Weaker Linear Variants
We describe a CCA-secure public-key encryption scheme, in the Cramer-Shoup paradigm, based on the Linear assumption of Boneh, Boyen, and Shacham. Through a comparison to the Kiltz tag-encryption scheme from TCC 2006, our scheme gives evidence that the CramerShoup paradigm yields CCA encryption with shorter ciphertexts than the Canetti-Halevi-Katz paradigm. We present a generalization of the Lin...
متن کاملNote for Cramer-Rao Bounds
• (z)r and (z)i denote the real and imaginary part of z. II. CONSTRAINED CRAMER-RAO BOUND A. Problem Statement Problem statement and notation are based on [1]. • a: a K × 1 non-random vector which are to be estimated. • r: an observation of a random vector . • â (R): an estimate of a basing on the observed vector r . It is required that â (R) satisfies M nonlinear equality constraints (M < K), ...
متن کاملComputing Constrained Cramer Rao Bounds
We revisit the problem of computing submatrices of the Cramér-Rao bound (CRB), which lower bounds the variance of any unbiased estimator of a vector parameter θ. We explore iterative methods that avoid direct inversion of the Fisher information matrix, which can be computationally expensive when the dimension of θ is large. The computation of the bound is related to the quadratic matrix program...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Zbornik radova Filozofskog fakulteta u Pristini
سال: 2016
ISSN: 0354-3293,2217-8082
DOI: 10.5937/zrffp46-10811